Bounded Floating Point: Identifying and Revealing Floating-Point Error
نویسندگان
چکیده
منابع مشابه
Floating-Point Numbers with Error Estimates (revised)
The original work [25] is here reconsidered, so many years after. The old text has been revised, plus several considerations have been added, in order to clarify some controversial aspects of the work, and to envision possible developments. A section has been added, to review the effects of the original paper. The study addresses the problem of precision in floating-point (FP) computations. A m...
متن کاملError bounds on complex floating-point multiplication
Given floating-point arithmetic with t-digit base-β significands in which all arithmetic operations are performed as if calculated to infinite precision and rounded to a nearest representable value, we prove that the product of complex values z0 and z1 can be computed with maximum absolute error |z0| |z1| 12β √ 5. In particular, this provides relative error bounds of 2−24 √ 5 and 2−53 √ 5 for I...
متن کاملCustomising Floating-Point Designs
This paper describes a method for customising the representation of floating-point numbers that exploits the flexibility of reconfigurable hardware. The method determines the appropriate size of mantissa and exponent for each operation in a design, so that a cost function with a given error specification for the output relative to a reference representation can be satisfied. Currently our tool,...
متن کاملFloating-Point LLL Revisited
The Lenstra-Lenstra-Lovász lattice basis reduction algorithm (LLL or L) is a very popular tool in public-key cryptanalysis and in many other fields. Given an integer d-dimensional lattice basis with vectors of norm less than B in an n-dimensional space, L outputs a socalled L-reduced basis in polynomial time O(dn log B), using arithmetic operations on integers of bit-length O(d log B). This wor...
متن کاملFloating point Cordic
In this paper, we present a full precision floating-point Cordic algorithm and a correponding word-serial Cordic architecture. The extension to existing block floating-point Cordic algorithms is in a floating-point representation for the angle. The angle is represented as a combination of exponent, micro-rotation bits and two bits to indicate prerotations over 2 and radians.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Science, Technology and Engineering Systems Journal
سال: 2021
ISSN: 2415-6698,2415-6698
DOI: 10.25046/aj060157